On solving sparse symmetric linear systems whose definiteness is unknown
نویسنده
چکیده
Solving a large, sparse, symmetric linear system Ax = b iteratively must use appropriate methods. The conjugate gradient (CG) method can break down if A is indefinite while algorithms such as SYMMLQ and MINRES, though stable for indefinite systems, are computationally more expensive than CG when applied to positive definite matrices. In this paper, we present an iterative method for the case where the definiteness of A is not known a priori. We demonstrate that this method reduces to the CG method when applied to positive definite systems and is numerically stable when applied to indefinite systems.
منابع مشابه
Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملSolving Reduced Kkt Systems in Barrier Methods for Linear and Quadratic Programming
In barrier methods for constrained optimization, the main work lies in solving large linear systems Kp = r, where K is symmetric and indefinite. For linear programs, these KKT systems are usually reduced to smaller positive-definite systems AHAq = s, where H is a large principal submatrix of K. These systems can be solved more efficiently, but AHA is typically more ill-conditioned than K. In or...
متن کاملDECOMPOSITION METHOD FOR SOLVING FULLY FUZZY LINEAR SYSTEMS
In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.
متن کاملComparison of some Preconditioned Krylov Methods for Solving Sparse Non-symmetric Linear Systems of Equations
Large sparse non-symmetric linear systems of equations often occur in many scientific and engineering applications. In this paper, we present a comparative study of some preconditioned Krylov iterative methods, namely CGS, Bi-CGSTAB, TFQMR and GMRES for solving such systems. To demonstrate their efficiency, we test and compare the numerical implementations of these methods on five numerical exa...
متن کاملConjugate gradient method - Wikipedia, the free encyclopedia
In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is symmetric and positive-definite. The conjugate gradient method is often implemented as an iterative algorithm, applicable to sparse systems that are too large to be handled by a direct implementation or other direct methods such as the ...
متن کامل